Study of the Queueing Model of Storage and Transmission Bandwidth Allocation
نویسندگان
چکیده
In this paper, we study a queueing model of storage and transmission bandwidth allocation in computer and communication systems, so we are interested to the behavior of a network understanding a queue which contains a number infinite of items of size 1, 2, 3 and a bin of capacity C = N (N is finite). An analysis of the stability properties of the bandwidth allocation algorithm First Fit for the distributions concentrated is made on these three sizes. In this paper fluid limits are used to obtain the conditions of ergodicity. 2000 Mathematics Subject Classification: 37A25, 60K25.
منابع مشابه
Jointly power and bandwidth allocation for a heterogeneous satellite network
Due to lack of resources such as transmission power and bandwidth in satellite systems, resource allocation problem is a very important challenge. Nowadays, new heterogeneous network includes one or more satellites besides terrestrial infrastructure, so that it is considered that each satellite has multi-beam to increase capacity. This type of structure is suitable for a new generation of commu...
متن کاملAn Integrated Queuing Model for Site Selection and Inventory Storage Planning of a Distribution Center with Customer Loss Consideration
Discrete facility location, Distribution center, Logistics, Inventory policy, Queueing theory, Markov processes, The distribution center location problem is a crucial question for logistics decision makers. The optimization of these decisions needs careful attention to the fixed facility costs, inventory costs, transportation costs and customer responsiveness. In this paper we stu...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملFuzzy Hierarchical Location-Allocation Models for Congested Systems
There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...
متن کاملA New Model for Location-Allocation Problem within Queuing Framework
This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...
متن کامل